Random access to Fibonacci encoded files

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Random access to Fibonacci encoded files

AWavelet tree is a data structure adjoined to a file that has been compressed by a variable length encoding, which allows direct access to the underlying file, resulting in the fact that the compressed file is not needed any more. We adapt, in this paper, the Wavelet tree to Fibonacci Codes, so that in addition to supporting direct access to the Fibonacci encoded file, we also increase the comp...

متن کامل

Random Access to Fibonacci Codes

A Wavelet tree allows direct access to the underlying file, resulting in the fact that the compressed file is not needed any more. We adapt, in this paper, the Wavelet tree to Fibonacci Codes, so that in addition to supporting direct access to the Fibonacci encoded file, we also increase the compression savings when compared to the original Fibonacci compressed file.

متن کامل

Random Approaches to Fibonacci Identities

Many combinatorialists live by Mach’s words, and take it as a personal challenge. For example, nearly all of the Fibonacci identities in [5] and [6] have been explained by counting arguments [1, 2, 3]. Among the holdouts are those involving infinite sums and irrational quantities. However, by adopting a probabilistic viewpoint, many of the remaining identities can be explained combinatorially. ...

متن کامل

Random Fibonacci Sequences

We study the random Fibonacci tree, which is an infinite binary tree with non-negative numbers at each node defined as follows. The root consists of the number 1 with a single child also the number 1. Then we define the tree recursively in the following way: if x is the parent of y, then y has two children, namely |x−y| and x+y. This tree was studied by Benoit Rittaud [?] who proved that any pa...

متن کامل

Monitoring Access to Shared Memory-Mapped Files

The post-mortem state of a compromised system may not contain enough evidence regarding what transpired during an attack to explain the attacker’s modus operandi. Current systems that reconstruct sequences of events gather potential evidence at runtime by monitoring events and objects at the system call level. The reconstruction process starts with a detection point, such as a file with suspici...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2016

ISSN: 0166-218X

DOI: 10.1016/j.dam.2015.11.003